#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e6 + 10, MOD = 1e9 + 7;

LL f[N], g[N];
LL d[N];

LL qpow(LL a, LL b, LL p)
{
	LL ans = 1;
	while(b)
	{
		if(b & 1) ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}

void init()
{
	int n = 1e6;
	f[0] = 1;
	for(int i = 1;i <= n;i ++) f[i] = f[i - 1] * i % MOD;
	g[n] = qpow(f[n], MOD - 2, MOD);
	for(int i = n - 1;i >= 0;i --) g[i] = g[i + 1] * (i + 1) % MOD;

	d[2] = 1;
	for(int i = 3;i <= n;i ++) d[i] = (i - 1) * (d[i - 1] + d[i - 2]) % MOD;
}

LL C(LL n, LL m, LL p)
{
	if(n < m) return 0;
	return f[n] * g[m] % MOD * g[n - m] % MOD;
}

int main()
{
	int T; cin >> T;
	init();
	while(T --)
	{
		LL n, m; cin >> n >> m;
		if(n == m) cout << 1 << endl;
		else cout << C(n, m, MOD) * d[n - m] % MOD << endl;
	}
	return 0;
}